${\text{ASPACE}}(o(\log \log n))$ is Regular
نویسندگان
چکیده
منابع مشابه
StUSPACE(log n) <= DSPACE(log²n / log log n)
We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملRuspace(log N) Dspace(log 2 N= Log Log N) 1
We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملThe Average Complexity of Moore ’ s State Minimization Algorithm is O ( n log log n ) ⋆ Julien
We prove that the average complexity, for the uniform distribution on complete deterministic automata, of Moore’s state minimization algorithm is O(n log log n), where n is the number of states in the input automata.
متن کاملThe Average Complexity of Moore's State Minimization Algorithm Is O(n log log n)
We prove that the average complexity, for the uniform distribution on complete deterministic automata, of Moore’s state minimization algorithm is O(n log log n), where n is the number of states in the input automata.
متن کاملComputing -free Nfa from Regular Expressions in O(n Log 2 (n)) Time ?
The standard procedure to transform a regular expression to an-free NFA yields a quadratic blow-up of the number of transitions. For a long time this was viewed as an unavoidable fact. Recently Hromkovi c et.al. 5] exhibited a construction yielding-free NFA with O(n log 2 (n)) transitions. A rough estimation of the time needed for their construction shows a cubic time bound. The known lower bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1993
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0222011